Deriving and Applying Logic Program Transformers

نویسندگان

  • Penny Anderson
  • David A. Basin
چکیده

We present a methodology for logic program development based on the use of ver-iied transformation templates. We use the Isabelle Logical Framework to formalize transformation templates as inference rules. We derive these rules in higher-order logic and afterwards use higher-order uniication to apply them to develop programs in a deductive synthesis style. Our work addresses the pragmatics of template formalization and application as well as which theories and semantics of programs and data we require to derive templates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Estimation of Weibull Distribution Parameters in order to Provide Preventive-Corrective Maintenance Program for Power Transformers

In this paper, a new method for modelling and estimation of reliability parameters of power transformer components in distribution and transmission voltage levels for preventive-corrective maintenance schedule of transformers is proposed. In this method, with optimal estimation of Weibull distribution parameters using least squares method and input data uncertainty reduction, failure rate and p...

متن کامل

The Choice-coordination Problem: Notes for a Correctness Proof

Rabin's Choice-coordination algorithm 5] allows a number of identical processes to agree on a choice between two alternatives while nevertheless executing asynchronously. The algorithm is analysed here with techniques based on prob-abilistic predicate transformers 3], in particular applying invariants and variants as set out in 2], and using a probabilistic temporal logic.

متن کامل

Deriving Event-based Document Transformers from Tree-based Speciications

The event-based document transformers, which process a structured document simply as a stream of parsing events, have an advantage over the conventional tree-based ones that they can avoid the unnecessary intermediate data construction. This paper proposes an algorithm which derives an event-based transformer from a given speci-cation of a document transformation. The derivation of an event-bas...

متن کامل

Generalizing Propositional Dynamic Logic

A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...

متن کامل

Deriving Event-Based Document Transformers from Tree-Based Specifications

Structured documents are usually processed by tree-based document transformers, which transform the document tree representing the structure of the input document into another tree structure. Event-based document transformers, by contrast, recognize the input as a stream of parsing events, i. e. lexical tokens, and process the events one by one in an event-driven manner. Event-based document tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995